Geometry of complex networks and topological centrality
نویسندگان
چکیده
منابع مشابه
Geometry of Complex Networks and Topological Centrality
We explore the geometry of complex networks in terms of an n-dimensional Euclidean embedding represented by the Moore-Penrose pseudo-inverse of the graph Laplacian (L). The squared distance of a node i to the origin in this n-dimensional space (l ii ), yields a topological centrality index, defined as C (i) = 1/l ii . In turn, the sum of reciprocals of individual node centralities, ∑ i 1/C (i) ...
متن کاملAttack Robustness and Centrality of Complex Networks
Many complex systems can be described by networks, in which the constituent components are represented by vertices and the connections between the components are represented by edges between the corresponding vertices. A fundamental issue concerning complex networked systems is the robustness of the overall system to the failure of its constituent parts. Since the degree to which a networked sy...
متن کاملSubgraph centrality in complex networks.
We introduce a new centrality measure that characterizes the participation of each node in all subgraphs in a network. Smaller subgraphs are given more weight than larger ones, which makes this measure appropriate for characterizing network motifs. We show that the subgraph centrality [C(S)(i)] can be obtained mathematically from the spectra of the adjacency matrix of the network. This measure ...
متن کاملControlling centrality in complex networks
Dipartimento di Fisica ed Astronomia, Università di Catania, and INFN Sezione di Catania, 95123, Catania, Italy, Laboratorio sui Sistemi Complessi, Scuola Superiore di Catania, Università di Catania, 95123, Catania, Italy, Departamento de Matemática Aplicada, Universidad Rey Juan Carlos, 28933, Madrid, Spain, Dipartimento di Matematica e Informatica, Università di Catania, Via S., Sofia, 64, 95...
متن کاملFrom centrality to temporary fame: Dynamic centrality in complex networks
We develop a new approach to the study of the dynamics of link utilization in complex networks using records of communication in a large social network. Counter to the perspective that nodes have particular roles, we find roles change dramatically from day to day. “Local hubs” have a power law degree distribution over time, with no characteristic degree value. Our results imply a significant re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2013
ISSN: 0378-4371
DOI: 10.1016/j.physa.2013.04.013